Distributions of the k-major index in random words and permutations

نویسندگان

  • Wilbur Li
  • Cesar Cuenca
چکیده

The most noted permutation statistics, inversion number and major index, have been studied extensively in recent decades. Many results found regarding their joint distribution and normality have been found. We focus on the k-major index, a natural interpolation between the inversion number and major index, which exhibits elegant properties of equidistribution. We generalize normality and equidistribution to words with fixed alphabet size and large length. We then draw analogs from the fluctuation of the k-major index on a random, fixed permutation or word as k varies to standard Brownian motion. We prove a fundamental similarity of covariance independence, and find other connections. Finally, we observe limiting shapes of joint distributions of other pairs of potentially promising statistics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STATISTICAL DISTRIBUTIONS ON WORDS AND q-CALCULUS ON PERMUTATIONS

As for the symmetric group of ordinary permutations there is also a statistical study of the group of signed permutations, that consists of calculating multivariable generating functions for this group by statistics involving record values and the length function. Two approaches are here systematically explored, using the flag-major index on the one hand, and the flag-inversion number on the ot...

متن کامل

Dispersive Ordering and k-out-of-n Systems

Extended Abstract. The simplest and the most common way of comparing two random variables is through their means and variances. It may happen that in some cases the median of X is larger than that of Y, while the mean of X is smaller than the mean of Y. However, this confusion will not arise if the random variables are stochastically ordered. Similarly, the same may happen if one would like to ...

متن کامل

Sharply $(n-2)$-transitive Sets of Permutations

Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...

متن کامل

On the Distributions of the Lengths of the Longest Increasing and Decreasing Subsequences in Random Words

We consider the distributions of the lengths of the longest weakly increasing and strongly decreasing subsequences in words of length N from an alphabet of k letters. (In the limit as k → ∞ these become the corresponding distributions for permutations on N letters.) We find Toeplitz determinant representations for the exponential generating functions (on N) of these distribution functions and s...

متن کامل

On the Distributions of the Lengths of the Longest Monotone Subsequences in Random Words

We consider the distributions of the lengths of the longest weakly increasing and strongly decreasing subsequences in words of length N from an alphabet of k letters. (In the limit as k → ∞ these become the corresponding distributions for permutations on N letters.) We find Toeplitz determinant representations for the exponential generating functions (on N) of these distribution functions and s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016